Roadmap-Based Flocking for Complex Environments

نویسندگان

  • O. Burçhan Bayazit
  • Jyh-Ming Lien
  • Nancy M. Amato
چکیده

Flocking behavior is very common in nature, and there have been ongoing research efforts to simulate such behavior in computer animations and robotics applications. Generally, such work considers behaviors that can be determined independently by each flock member solely by observing its local environment, e.g., the speed and direction of its neighboring flock members. Since flock members are not assumed to have global information about the environment, only very simple navigation and planning techniques have been considered for such flocks. In this work, we investigate how the addition of global information in the form of a roadmap of the environment enables more sophisticated flocking behaviors. In particular, we study and propose new techniques for three distinct group behaviors: homing, exploring and shepherding. These behaviors exploit global knowledge of the environment and utilize knowledge gathered by all flock members. This knowledge is communicated by allowing individual flock members to dynamically update the shared roadmap to reflect (un)desirable routes or regions. We present experimental results showing how the judicious use of simple roadmaps of the environment enables more complex behaviors to be obtained at minimal cost. Animations of these behaviors can be viewed at http://parasol.tamu.edu.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Better Group Behaviors in Complex Environments using Global Roadmaps

While many methods to simulate flocking behaviors have been proposed, these techniques usually only provide simplistic navigation and planning capabilities because each flock member’s behavior depends only on its local environment. In this work, we investigate how the addition of global information in the form of a roadmap of the environment enables more sophisticated flocking behaviors and sup...

متن کامل

A Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks

Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...

متن کامل

Roadmap-Based Level Clearing of Buildings

In this paper we describe a roadmap-based approach for a multi-agent search strategy to clear a building or multi-story environment. This approach utilizes an encoding of the environment in the form of a graph (roadmap) that is used to encode feasible paths through the environment. The roadmap is partitioned into regions, e.g., one per level, and we design region-based search strategies to cove...

متن کامل

Roadmap-Based Pursuit-Evasion in 3D Structures

We present an approach to the pursuit-evasion problem which is applicable to complex, multi-level environments. Studying each aspect of this problem in 3D structured environments is a distinct extension over many previous approaches. We also utilize our roadmap-based approach to multi-agent behavior when tracking agents of interest. Results are presented in three multi-level environments to hig...

متن کامل

Region Roadmap Connection in Parallel Sampling-Based Motion Planning

In today’s society, parallel computing is commonplace. Motion planning is a computationally complex problem in which solution methodologies can exploit parallelism for complex problems. In one approach to parallel sampling-based motion planning, the environment is divided among processors so that roadmaps can be constructed for each region of the environment independently. Afterwards, the roadm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002